Semantic Types and Approximation for Featherweight Java

We consider semantics for the class-based object-oriented calculus Featherweight Java (without casts) based uponapproximation. We also define an intersection type assignment system for this calculus and show that it satisfies subjectreduction and expansion, i.e. types are preserved under reduction and its converse. We establish a link between typeassignment and the approximation semantics by showing an approximation result, which leads to a sufficient conditionfor the characterisation of head-normalisation and termination.We show the expressivity of both our calculus and our type system by defining an encoding of Combinatory Logicinto our calculus and showing that this encoding preserves typeability. We also show that our system characterises thenormalising and strongly normalising terms for this encoding. We thus demonstrate that the great analytic capabilitiesof intersection types can be applied to the context of class-based object orientation.